Function Decomposition and Synthesis Using Linear Sifting
نویسندگان
چکیده
In order to simplify a synthesis task for particularly hard functions it is sometimes inevitable to decompose the function in a preprocessing step. We propose a new algorithm for automatically decomposing a target function by extracting a linear lter within the synthesis process. The algorithm is an application of the Linear Sifting algorithm which has been proposed in [6]. Using this method we were able to synthesize functions with standard tools which fail otherwise.
منابع مشابه
Image analysis by bidimensional empirical mode decomposition
Recent developments in analysis methods on the non-linear and non-stationary data have received large attention by the image analysts. In 1998, Huang introduced the empirical mode decomposition (EMD) in signal processing. The EMD approach, fully unsupervised, proved reliable monodimensional (seismic and biomedical) signals. The main contribution of our approach is to apply the EMD to texture ex...
متن کاملLinear Sifting of Decision Diagrams yChristoph
We propose a new algorithm, called linear sifting, for the optimization of decision diagrams that combines the ee-ciency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples , and that in many cases it leads to substantially more compact diagrams when compared to simple variable reordering. We show in what sense linear transformation...
متن کاملBidimensional Empirical Mode Decomposition Modified for Texture Analysis
This study introduces a new approach based on Bidimensional Empirical Mode Decomposition (BEMD) to extract texture features at multiple scales or spatial frequencies. Moreover, it can resolve the intrawave frequency modulation provided the frequency modulation. This decomposition, obtained by the bidimensional sifting process, plays an important role in the characterization of regions in textur...
متن کاملNumerical solution of the one dimensional non-linear Burgers equation using the Adomian decomposition method and the comparison between the modified Local Crank-Nicolson method and the VIM exact solution
The Burgers’ equation is a simplified form of the Navier-Stokes equations that very well represents their non-linear features. In this paper, numerical methods of the Adomian decomposition and the Modified Crank – Nicholson, used for solving the one-dimensional Burgers’ equation, have been compared. These numerical methods have also been compared with the analytical method. In contrast to...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997